Strong Stationary Times for Non-Uniform Markov Chains
نویسنده
چکیده
This thesis studies several approaches to bounding the total variation distance of a Markov chain, focusing primarily on the strong stationary time approach. While strong stationary times have been used successfully with uniform walks on groups, non-uniform walks have proven harder to analyze. This project applied strong stationary techniques to simple non-uniform walks in the hope of finding some more general tools.
منابع مشابه
Random generation of 2 times 2 times ... times 2 times J contingency tables
We propose two Markov chains for sampling (m + 1)-dimensional contingency tables indexed by {1, 2}m × {1, 2, . . . , n}. Stationary distributions of our chains are the uniform distribution and a conditional multinomial distribution (which is equivalent to the hypergeometric distribution ifm=1). Mixing times of our chains are bounded by ( 1 2 )n(n− 1) ln(N/(2m ))= ( 1 2 )n(n− 1) ln(dn/ ), where ...
متن کاملFinite Markov Chains and the Top-to-random Shuffle
In this paper, I present an introduction to Markov chains, basic tools to analyze them, and an example, the top-to-random shuffle. I cover the existence and uniqueness of stationary distributions, the Convergence Theorem, total variation distance, mixing time, and strong stationary times. Using these tools, I show that the top-to-random shuffle on a deck of n cards mixes the deck in approximate...
متن کاملMixing Times for Uniformly Ergodic Markov Chains
Consider the class of discrete time, general state space Markov chains which satist)' a "'uniform ergodicity under sampling" condition. There are many ways to quantify the notion of "mixing time", i.e., time to approach stationarity from a worst initial state. We prove results asserting equivalence (up to universal constants) of different quantifications of mixing time. This work combines three...
متن کاملSpeed of convergence to stationarity for Markov chains: Strong Stationary Times, stochastic monotonicity
In first part we will discuss one of the methods in more details: Strong Stationary Time. It gives probabilistic approach to bounding the rate of convergence for Markov chains. It was introduced by D. Aldous and P. Diaconis in [1]. We will review some known examples (for example: random walk on Zn, top-to-random shuffling cards) and use it to show that 2n log n + cn steps are enough to be “near...
متن کاملA Local Limit Theorem for a Family of Non-reversible Markov Chains
Abstract. By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are not reversible, have little symmetry, do not have uniform stationary distributions, and can be nearly periodic, prior general bounds on rates of c...
متن کامل